A (204,188) Reed-Solomon Decoder using Decomposed Euclidean Algorithm

نویسندگان

  • Hsie-Chia Chang
  • Chih-Yu Cheng
  • Shu-Hui Tsai
  • Chen-Yi Lee
چکیده

The DVB Project, which is used for broadcasting all kinds of data has very successfully developed a considerable list of specifications for Digital Video Broadcasting. In order to mitigate the errors, a (204,188) Reed-Solomon Decoder is used in DVB for error correction. A ( N , K ) RS code contains K message symbols and N K parity checking symbols, and is capable of correcting up to t = lv J symbol errors. The most popular RS decoder architecture today, [l], [2], can be summarized into four steps: (1) calculating the syndromes from the received codeword, (2) computing the error locator polynomial and the error evaluator polynomial, (3) finding the error locations, and (4) computing error values. The second step in the four-step procedure involves solving the key equation [l], which is

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An area-efficient architecture for Reed-Solomon decoder using the inversionless decomposed Euclidean algorithm

We propose a new area-efficient architecture to implement the Euclidean algorithm. which is frequently used in BCH and Reed-Solomon decoders. For Reed-Solomon decoders, our architecture can be applied to the correction of errors as well as erasures. An iriversioizless decomposed Euclidean algorithni is adopted which not only eliminates the finitefield inverter (FFI) but also introduces an effic...

متن کامل

Pipelined recursive modified Euclidean algorithm block for low-complexity, high-speed Reed–Solomon decoder

A novel pipelined recursive modified Euclidean (ME) algorithm block for the low-complexity, high-speed Reed–Solomon (RS) decoder is presented. The deeply pipelined recursive structure enables implementation of a significantly low-complexity ME algorithm block with much improved clock frequency. The low-complexity, high-speed RS decoder using the pipelined recursive ME algorithm block has been i...

متن کامل

An Area-Efficient Euclidean Algorithm Block for Reed-Solomon Decoder

This paper presents a new area-efficient architrecture to implement the Euclidean algorithm, which is frequently used in Reed-Solomon decoders. The RS (255,239) decoder using the Euclidean algorithm has been implemented with 0.13m CMOS technology with a supply voltage of 1.1V . We investigate hardware complexity, clock frequency and data processing rate for this Euclidean algorithm block. The r...

متن کامل

A Systolic Array Based Reed-solomon Decoder Realised Using Programmable Logic Devices

This paper describes the development of a Reed-Solomon (RS) Encoder-Decoder which implements the RS segment of the telemetry channel coding scheme recommended by the Consultative Committee on Space Data Systems (CCSDS)[1]. The Euclidean algorithm has been chosen for the decoder implementation, the hardware realization taking a systolic array approach. The fully pipelined decoder runs on a singl...

متن کامل

On the VLSI Design of a Pipeline Reed-Solomon Decoder Using Systolic Arrays

A new VLSI design of a pipeline Reed-Solomon decoder is presented. The transform decoding technique used in a previous article is replaced by a time domain algorithm through a detailed comparison of their VLSI implementations. A new architecture that implements the time domain algorithm permits efficient pipeline processing with reduced circuitry. Erasure correction capability is also incorpora...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000